Generating Regular Arithmetic Circuits with AlpHard

نویسندگان

  • LAURENT PERRAUDEAU
  • PATRICE QUINTON
  • SANJAY RAJOPADHYE
  • TANGUY RISSET
  • Patricia Le Moenner
  • Laurent Perraudeau
  • Patrice Quinton
  • Sanjay Rajopadhye
  • Tanguy Risset
چکیده

The eecient vlsi implementation of arithmetics operators requires that design be optimized, both by looking for eecient algorithms, and by producing compact regular layouts. We present AlpHard, a subset of Alpha { a language for the synthesis of regular algorithms. AlpHard is intended for specifying the Register Transfer Level (RTL) representation of an architecture, in such a way that any regularity in the algorithm is preserved. An AlpHard description can be obtained as the result of a formal derivation process, thus enabling diierent solutions to be found automatically from Alpha programs. In this paper we demonstrate the eeectiveness of AlpHard on the derivation of regular layouts for a two's complement bit-serial multiplier. G en erations de circuits arithm etiques r eguliers avec AlpHard R esum e : L'impl ementation eecace d'op erateurs arithm etiques n ecessite d'optimiser leur conception en travaillant sur deux aspects : la recherche d'algorithmes eecaces et la production de dessins de masques r eguliers compacts. Dans ce document nous pr esentons AlpHard, un sous-ensemble du langage Alpha utilis e pour la synth ese d'algorithmes r egu-liers. AlpHard est con cu pour sp eciier des architectures au niveau transfert de registres (RTL) de telle mani ere que la r egularit e des algorithmes initiaux est pr eserv ee. Une description AlpHard peut ^ etre le r esultat d'un processus de d erivation formelle. Cela rend possible l'exploration syst ematique de dii erentes solutions a partir d'un programme Alpha. Dans ce document nous d emontrons l'eecacit e d'AlpHard pour la d erivation de dessins de masques r eguliers sur l'exemple d'un multiplieur bits erie en compl ement a deux.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-communication SMC protocols from Boolean circuits

This report describes experiments in generating low-communication secure multi-party protocols on arithmetic circuits by providing a translation from a Boolean circuit format. Boolean circuits are typically used for Yao’s garbled circuits protocol, providing a constant-round computation with relatively large communication overhead. BGW-style protocols based on ring or field arithmetic have lowe...

متن کامل

A High-Speed Dual-Bit Parallel Adder based on Carbon Nanotube ‎FET technology for use in arithmetic units

In this paper, a Dual-Bit Parallel Adder (DBPA) based on minority function using Carbon-Nanotube Field-Effect Transistor (CNFET) is proposed. The possibility of having several threshold voltage (Vt) levels by CNFETs leading to wide use of them in designing of digital circuits. The main goal of designing proposed DBPA is to reduce critical path delay in adder circuits. The proposed design positi...

متن کامل

The Complexity of Two Register and Skew Arithmetic Computation

We study two register arithmetic computation and skew arithmetic circuits. Our main results are the following: • For commutative computations, we show that an exponential circuit size lower bound for a model of 2-register straight-line programs (SLPs) which is a universal model of computation (unlike width-2 algebraic branching programs that are not universal [AW11]). • For noncommutative compu...

متن کامل

A Study of Arithmetic Circuits and the Effect of Utilising Reed-Muller Techniques

Reed-Muller algebraic techniques, as an alternative means in logic design, became more attractive recently, because of their compact representations of logic functions and yielding of easily testable circuits. It is claimed by some researchers that ReedMuller algebraic techniques are particularly suitable for arithmetic circuits. In fact, no practical application in this field can be found in t...

متن کامل

How Do Evolved Digital Logic Circuits Generalise Successfully?

Contrary to indications made by prior researchers, digital logic circuits designed by artificial evolution to perform binary arithmetic tasks can generalise on inputs which were not seen during evolution. This phenomenon is demonstrated experimentally and speculatively explained in terms of the regular structure of binary arithmetic tasks and the nonoptimality of random circuits. This explanati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996